Queues on interacting networks
نویسندگان
چکیده
Interacting networks are different in nature to single networks. The study of queuing processes on interacting is underdeveloped. It presents new mathematical challenges and importance applications. This area operations research deserves careful study: theory needs incorporate high-order network interactions the performance analysis a system.
منابع مشابه
Throughput Optimal Scheduling Policies in Networks of Interacting Queues
This paper considers a fairly general model of constrained queuing networks that allows us to represent both MMBP (Markov Modulated Bernoulli Processes) arrivals and time-varying service constraints. We derive a set of sufficient conditions for throughput optimality of scheduling policies, which encompass and generalize all the results previously obtained in the field. This leads to the definit...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملA Technique for Computing Sojourn times in Large Networks of Interacting Queues
Consider a large number of interacting queues with symmetric interactions. In the asymptotic limit, the interactions between any fixed finite subcollection become negligible, and the overall effect of interactions can be replaced by an empirical rate. The evolution of each queue is given by a time inhomogeneous Markov process. This may be considered a technique for writing dynamic Erlang fixed-...
متن کاملInteracting queues with server selection and coordinated scheduling - application to cellular data networks
We consider a system of parallel servers handling users of various classes, whose service rates depend not only on user classes, but also on the set of active servers. We investigate the stability under two types of allocation strategies: (i) server assignment where the users are assigned to servers based on rates, load, and other considerations, and (ii) coordinated scheduling where the activi...
متن کاملFlow Management in Packet Networks Through Interacting Queues and Law-of-Mass-Action Scheduling
Classical queueing disciplines are work conserving: From the allocated channel’s perspective this makes sense as the full bandwidth is exploited by sending packets back-to-back. But formally and traffic engineering wise, the resulting network dynamics is difficult to handle. In this report, we show that deviating from this fundamental queuing assumption leads to much more controllable and analy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2022
ISSN: ['1572-9443', '0257-0130']
DOI: https://doi.org/10.1007/s11134-022-09771-w